Loosely Coupled Formulations for Automated Planning: An Integer Programming Perspective
نویسندگان
چکیده
منابع مشابه
Loosely Coupled Formulations for Automated Planning: An Integer Programming Perspective
We represent planning as a set of loosely coupled network flow problems, where each network corresponds to one of the state variables in the planning domain. The network nodes correspond to the state variable values and the network arcs correspond to the value transitions. The planning problem is to find a path (a sequence of actions) in each network such that, when merged, they constitute a fe...
متن کاملDecomposition of loosely coupled integer programs: A multiobjective perspective
We consider integer programming (IP) problems consisting of (possibly a large number of) subsystems and a small number of coupling constraints that link variables from different subsystems. Such problems are called loosely coupled or nearly decomposable. Motivated by recent developments in multiobjective programming (MOP), we develop a MOP-based decomposition algorithm to solve loosely coupled ...
متن کاملInteger Programming for Automated Auctions
Auctions allowing bids for combinations of items are important for (agent mediated) electronic commerce; compared to other auction mechanisms, they often increase the efficiency of the auction, while keeping risks for bidders low. The determination of an optimal winner combination in this type of auctions is a complex computational problem, which has recently attracted some research, and in thi...
متن کاملTowards Loosely-Coupled Programming on Petascale Systems
We have extended the Falkon execution framework to make loosely coupled petascale systems a practical and useful prog This work studies and measures the perf involved in applying this approach to enable th systems by a broader user community, and w Our work enables the execution of highly para composed of loosely coupled serial jobs with no the respective applications. This approach all potenti...
متن کاملcRRT∗: Planning loosely-coupled motions for multiple mobile robots
The planning of collision-free paths of a team of mobile robots involves many degrees of freedom and therefore the use of sampling-based methods is a good alternative. Among them, the RRT∗ planner has been proposed to cope with optimization problems, and has been proven to be asymptotically optimal. Any optimization function can be defined, although optimization has been usually focused on the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Artificial Intelligence Research
سال: 2008
ISSN: 1076-9757
DOI: 10.1613/jair.2443